The Effect of Garbage Collection on Cache Performance ; CU-CS-528-91

The Performance of Partitioned Garbage Collection in Object Databases ; CU-CS-653-93

Garbage Collection Using a Dynamic Threatening Boundary ; CU-CS-659-93

Cache Performance of Chronological Garbage Collection

This paper will present the cache performance analysis of Chronological Garbage Collection algorithm used in the LVM system. The LVM is a new Logic Virtual Machine for Prolog. It adopts one stack policy for all dynamic memory requirements and cooperates with an efficient garbage collection algorithm, the Chronological Garbage Collection, to recuperate space not as deliberate garbage collection ...

A Cache-Pinning Strategy for Improving Generational Garbage Collection

In generational garbage collection, the youngest generation of the heap is frequently traversed during garbage collection. Due to randomness of the traversal, memory access patterns are unpredictable and cache performance becomes crucial to garbage-collection efficiency. Our proposal to improve cache performance of garbage collection is to “pin” the youngest generation (sometimes called the nur...

Choosing a Set of Partitions to Collect in a Connectivity-Based Garbage Collector ; CU-CS-958-03

Connectivity-Based Garbage Collection is a new family of garbage collection algorithms that are based on potential object connectivity properties. Objects are placed into partitions based on a static connectivity analysis. When the program needs memory, the collector can choose a set of partitions to do a garbage collection on. This choice should maximize the expected benefit in reclaimed memor...